A generalization of the chromatic polynomial of a cycle
نویسنده
چکیده
We prove that if an edge of a cycle on n vertices is extended by adding k vertices, then the the chromatic polynomial of such generalized cycle is: P (Hk, λ) = (λ− 1) k ∑ i=0 λ + (−1)n(λ− 1).
منابع مشابه
Chromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملThe Path-Cycle Symmetric Function of a Digraph
Recently, Stanley [21] has defined a symmetric function generalization of the chromatic polynomial of a graph. Independently, Chung and Graham [4] have defined a digraph polynomial called the cover polynomial which is closely related to the chromatic polynomial of a graph (in fact, as we shall see, the cover polynomial of a certain digraph associated to a poset P coincides with the chromatic po...
متن کاملul 2 00 5 Set maps , umbral calculus , and the chromatic
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = ∑ T⊎U=S pT (x)pU (y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any polynomial sequence of binomial type. This leads to several new expansions of the chromatic polynomial. We also describe a set map generalization of Abel polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 13 شماره
صفحات -
تاریخ انتشار 2005